The vehicle routing problem with service level constraints

The vehicle routing problem with service level constraints

A Call-Routing Problem with Service-Level Constraints

We consider a queueing system, commonly found in inbound telephone call centers, that processes two types of work. Type-H jobs arrive at rate H , are processed at rate H , and are served first come, first served within class. A service-level constraint of the form E delay or P delay limits the delay in queue that these jobs may face. An infinite backlog of type-L jobs awaits processing at rate ...

The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem

This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...

The Vehicle Routing Problem with Stochastic Demand and Duration Constraints

Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duration limits can effectively and efficiently be incorporated in solution approaches that build fixed, or a priori, tours for such problems. We do so by assuming that each tour must be duration-feasible for all demand reali...

Metaheuristics for the vehicle routing problem with loading constraints

We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is motivated by a real-world transportation problem occurring to a wood-products retailer, which delivers its products to a number of customers in a specific region. We solve the problem by means of two different metaheurist...